0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.17/0.43 % Computer : n009.cluster.edu 0.17/0.43 % Model : x86_64 x86_64 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.17/0.43 % Memory : 8046.5625MB 0.17/0.43 % OS : Linux 6.8.0-71-generic 0.17/0.43 % CPULimit : 1440 0.17/0.43 % WCLimit : 180 0.17/0.43 % DateTime : Mon Jul 27 09:21:13 UTC 2026 0.17/0.43 % CPUTime : 0.17/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.17/0.50 Running higher-order theorem proving 0.36/0.64 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p 0.40/0.95 % Version: 3.5.1-ho 0.40/0.95 % Preprocessing class: HSLSSMSMSSSNSFA. 0.40/0.95 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.40/0.95 % Starting new_ho_10 with 540s (3) cores 0.40/0.95 % Starting sh2lt with 180s (1) cores 0.40/0.95 % Starting new_ho_5 with 180s (1) cores 0.40/0.95 % Starting full_lambda_5 with 180s (1) cores 0.40/0.95 % Starting sh9 with 180s (1) cores 0.40/0.95 % Starting ehoh_best8_lambda with 180s (1) cores 0.40/0.95 % new_ho_10 with pid 936645 completed with status 0 0.40/0.95 % Result found by new_ho_10 0.40/0.95 % Preprocessing class: HSLSSMSMSSSNSFA. 0.40/0.95 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.40/0.95 % Starting new_ho_10 with 540s (3) cores 0.40/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.40/0.95 % No SInE strategy applied 0.40/0.95 % Search class: HGHSM-FSLM31-DSFFFFBN 0.40/0.95 % Scheduled 7 strats onto 3 cores with 540 seconds (540 total) 0.40/0.95 % Starting SubtermCWHack with 49s (1) cores 0.40/0.95 % Starting new_ho_10 with 55s (1) cores 0.40/0.95 % Starting lpo5_fix with 82s (1) cores 0.40/0.95 % new_ho_10 with pid 936655 completed with status 0 0.40/0.95 % Result found by new_ho_10 0.40/0.95 % Preprocessing class: HSLSSMSMSSSNSFA. 0.40/0.95 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.40/0.95 % Starting new_ho_10 with 540s (3) cores 0.40/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.40/0.95 % No SInE strategy applied 0.40/0.95 % Search class: HGHSM-FSLM31-DSFFFFBN 0.40/0.95 % Scheduled 7 strats onto 3 cores with 540 seconds (540 total) 0.40/0.95 % Starting SubtermCWHack with 49s (1) cores 0.40/0.95 % Starting new_ho_10 with 55s (1) cores 0.40/0.95 % Preprocessing time : 0.018 s 0.40/0.95 % Presaturation interreduction done 0.40/0.95 0.40/0.95 % Proof found! 0.40/0.95 % SZS status Theorem 0.40/0.95 % SZS output start CNFRefutation 0.40/0.95 thf(decl_sort1, type, int: $tType). 0.40/0.95 thf(decl_sort2, type, nat: $tType). 0.40/0.95 thf(decl_23, type, one_one_int: int). 0.40/0.95 thf(decl_24, type, one_one_nat: nat). 0.40/0.95 thf(decl_26, type, plus_plus_int: int > int > int). 0.40/0.95 thf(decl_27, type, plus_plus_nat: nat > nat > nat). 0.40/0.95 thf(decl_30, type, zero_zero_int: int). 0.40/0.95 thf(decl_34, type, bit0: int > int). 0.40/0.95 thf(decl_35, type, bit1: int > int). 0.40/0.95 thf(decl_36, type, pls: int). 0.40/0.95 thf(decl_37, type, number_number_of_int: int > int). 0.40/0.95 thf(decl_38, type, number_number_of_nat: int > nat). 0.40/0.95 thf(decl_41, type, semiri1621563631at_int: nat > int). 0.40/0.95 thf(decl_45, type, ord_less_int: int > int > $o). 0.40/0.95 thf(decl_48, type, ord_less_eq_int: int > int > $o). 0.40/0.95 thf(decl_51, type, power_power_int: int > nat > int). 0.40/0.95 thf(decl_55, type, n: nat). 0.40/0.95 thf(fact_176_number__of__is__id, axiom, ![X109:int]:(((number_number_of_int @ X109)=(X109))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_176_number__of__is__id)). 0.40/0.95 thf(conj_0, conjecture, ((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))!=(zero_zero_int)), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', conj_0)). 0.40/0.95 thf(fact_25_semiring__norm_I110_J, axiom, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_25_semiring__norm_I110_J)). 0.40/0.95 thf(fact_231_field__power__not__zero, axiom, ![X133:nat, X164:int]:((((X164)!=(zero_zero_int))=>((power_power_int @ X164 @ X133)!=(zero_zero_int)))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_231_field__power__not__zero)). 0.40/0.95 thf(fact_18_semiring__one__add__one__is__two, axiom, ((plus_plus_int @ one_one_int @ one_one_int)=(number_number_of_int @ (bit0 @ (bit1 @ pls)))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_18_semiring__one__add__one__is__two)). 0.40/0.95 thf(fact_98_Pls__def, axiom, ((pls)=(zero_zero_int)), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_98_Pls__def)). 0.40/0.95 thf(fact_103_Bit0__def, axiom, ![X109:int]:(((bit0 @ X109)=(plus_plus_int @ X109 @ X109))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_103_Bit0__def)). 0.40/0.95 thf(fact_45_nat__1__add__1, axiom, ((plus_plus_nat @ one_one_nat @ one_one_nat)=(number_number_of_nat @ (bit0 @ (bit1 @ pls)))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_45_nat__1__add__1)). 0.40/0.95 thf(fact_447_zless__le, axiom, ![X83:int, X4:int]:((((ord_less_eq_int @ X83 @ X4)&((X83)!=(X4)))<=>(ord_less_int @ X83 @ X4))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_447_zless__le)). 0.40/0.95 thf(fact_0_n1pos, axiom, (ord_less_int @ zero_zero_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n))), file('/export/starexec/sandbox2/tmp/tmp.btZh8ryms4/E---3.1_936632.p', fact_0_n1pos)). 0.40/0.95 thf(c_0_10, plain, ![X3163:int]:(((number_number_of_int @ X3163)=(X3163))), inference(variable_rename,[status(thm)],[fact_176_number__of__is__id])). 0.40/0.95 thf(c_0_11, negated_conjecture, ~(((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))!=(zero_zero_int))), inference(assume_negation,[status(cth)],[conj_0])). 0.40/0.95 thf(c_0_12, plain, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), inference(split_conjunct,[status(thm)],[fact_25_semiring__norm_I110_J])). 0.40/0.95 thf(c_0_13, plain, ![X1:int]:(((number_number_of_int @ X1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.40/0.95 thf(c_0_14, plain, ![X133:nat, X164:int]:((((X164)!=(zero_zero_int))=>((power_power_int @ X164 @ X133)!=(zero_zero_int)))), inference(fof_simplification,[status(thm)],[fact_231_field__power__not__zero])). 0.40/0.95 thf(c_0_15, negated_conjecture, ((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))=(zero_zero_int)), inference(fof_simplification,[status(thm)],[c_0_11])). 0.40/0.95 thf(c_0_16, plain, ((plus_plus_int @ one_one_int @ one_one_int)=(number_number_of_int @ (bit0 @ (bit1 @ pls)))), inference(split_conjunct,[status(thm)],[fact_18_semiring__one__add__one__is__two])). 0.40/0.95 thf(c_0_17, plain, ((bit1 @ pls)=(one_one_int)), inference(rw,[status(thm)],[c_0_12, c_0_13])). 0.40/0.95 thf(c_0_18, plain, ![X2356:nat, X2357:int]:((((X2357)=(zero_zero_int))|((power_power_int @ X2357 @ X2356)!=(zero_zero_int)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])). 0.40/0.95 thf(c_0_19, negated_conjecture, ((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))=(zero_zero_int)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.40/0.95 thf(c_0_20, plain, ((pls)=(zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_98_Pls__def])). 0.40/0.95 thf(c_0_21, plain, ![X2462:int]:(((bit0 @ X2462)=(plus_plus_int @ X2462 @ X2462))), inference(variable_rename,[status(thm)],[fact_103_Bit0__def])). 0.40/0.95 thf(c_0_22, plain, ((plus_plus_nat @ one_one_nat @ one_one_nat)=(number_number_of_nat @ (bit0 @ (bit1 @ pls)))), inference(split_conjunct,[status(thm)],[fact_45_nat__1__add__1])). 0.40/0.95 thf(c_0_23, plain, ((bit0 @ one_one_int)=(plus_plus_int @ one_one_int @ one_one_int)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_13]), c_0_17])). 0.40/0.95 thf(c_0_24, plain, ![X83:int, X4:int]:((((ord_less_eq_int @ X83 @ X4)&((X83)!=(X4)))<=>(ord_less_int @ X83 @ X4))), inference(fof_simplification,[status(thm)],[fact_447_zless__le])). 0.40/0.95 thf(c_0_25, plain, ![X1:int, X3:nat]:((((X1)=(zero_zero_int))|((power_power_int @ X1 @ X3)!=(zero_zero_int)))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.40/0.95 thf(c_0_26, negated_conjecture, ((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))=(pls)), inference(rw,[status(thm)],[c_0_19, c_0_20])). 0.40/0.95 thf(c_0_27, plain, ![X1:int]:(((bit0 @ X1)=(plus_plus_int @ X1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.40/0.95 thf(c_0_28, plain, ((number_number_of_nat @ (plus_plus_int @ one_one_int @ one_one_int))=(plus_plus_nat @ one_one_nat @ one_one_nat)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_17]), c_0_23])). 0.40/0.95 thf(c_0_29, plain, ![X2266:int, X2267:int]:(((~(ord_less_eq_int @ X2266 @ X2267)|((X2266)=(X2267))|(ord_less_int @ X2266 @ X2267))&(((ord_less_eq_int @ X2266 @ X2267)|~(ord_less_int @ X2266 @ X2267))&(((X2266)!=(X2267))|~(ord_less_int @ X2266 @ X2267))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])). 0.40/0.95 thf(c_0_30, plain, (ord_less_int @ zero_zero_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n))), inference(split_conjunct,[status(thm)],[fact_0_n1pos])). 0.40/0.95 thf(c_0_31, plain, ![X1:int, X3:nat]:((((X1)=(pls))|((power_power_int @ X1 @ X3)!=(pls)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_20]), c_0_20])). 0.40/0.95 thf(c_0_32, negated_conjecture, ((power_power_int @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n)) @ (plus_plus_nat @ one_one_nat @ one_one_nat))=(pls)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_17]), c_0_27]), c_0_28])). 0.40/0.95 thf(c_0_33, plain, ![X1:int, X2:int]:((((X1)!=(X2))|~((ord_less_int @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_29])). 0.40/0.95 thf(c_0_34, plain, (ord_less_int @ pls @ (plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n))), inference(rw,[status(thm)],[c_0_30, c_0_20])). 0.40/0.95 thf(c_0_35, negated_conjecture, ((plus_plus_int @ one_one_int @ (semiri1621563631at_int @ n))=(pls)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.40/0.95 thf(c_0_36, plain, ![X1:int]:(~((ord_less_int @ X1 @ X1))), inference(er,[status(thm)],[c_0_33])). 0.40/0.95 thf(c_0_37, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35]), c_0_36]), ['proof']). 0.40/0.95 % SZS output end CNFRefutation 0.40/0.95 % Parsed axioms : 741 0.40/0.95 % Removed by relevancy pruning/SinE : 0 0.40/0.95 % Initial clauses : 1033 0.40/0.95 % Removed in clause preprocessing : 128 0.40/0.95 % Initial clauses in saturation : 905 0.40/0.95 % Processed clauses : 1009 0.40/0.95 % ...of these trivial : 128 0.40/0.95 % ...subsumed : 229 0.40/0.95 % ...remaining for further processing : 652 0.40/0.95 % Other redundant clauses eliminated : 75 0.40/0.95 % Clauses deleted for lack of memory : 0 0.40/0.95 % Backward-subsumed : 18 0.40/0.95 % Backward-rewritten : 22 0.40/0.95 % Generated clauses : 94 0.40/0.95 % ...of the previous two non-redundant : 60 0.40/0.95 % ...aggressively subsumed : 0 0.40/0.95 % Contextual simplify-reflections : 2 0.40/0.95 % Paramodulations : 30 0.40/0.95 % Factorizations : 0 0.40/0.95 % NegExts : 0 0.40/0.95 % Equation resolutions : 75 0.40/0.95 % Disequality decompositions : 0 0.40/0.95 % Total rewrite steps : 933 0.40/0.95 % ...of those cached : 810 0.40/0.95 % Propositional unsat checks : 0 0.40/0.95 % Propositional check models : 0 0.40/0.95 % Propositional check unsatisfiable : 0 0.40/0.95 % Propositional clauses : 0 0.40/0.95 % Propositional clauses after purity: 0 0.40/0.95 % Propositional unsat core size : 0 0.40/0.95 % Propositional preprocessing time : 0.000 0.40/0.95 % Propositional encoding time : 0.000 0.40/0.95 % Propositional solver time : 0.000 0.40/0.95 % Success case prop preproc time : 0.000 0.40/0.95 % Success case prop encoding time : 0.000 0.40/0.95 % Success case prop solver time : 0.000 0.40/0.95 % Current number of processed clauses : 53 0.40/0.95 % Positive orientable unit clauses : 31 0.40/0.95 % Positive unorientable unit clauses: 0 0.40/0.95 % Negative unit clauses : 16 0.40/0.95 % Non-unit-clauses : 6 0.40/0.95 % Current number of unprocessed clauses: 452 0.40/0.95 % ...number of literals in the above : 967 0.40/0.95 % Current number of archived formulas : 0 0.40/0.95 % Current number of archived clauses : 536 0.40/0.95 % Clause-clause subsumption calls (NU) : 37989 0.40/0.95 % Rec. Clause-clause subsumption calls : 32764 0.40/0.95 % Non-unit clause-clause subsumptions : 196 0.40/0.95 % Unit Clause-clause subsumption calls : 245 0.40/0.95 % Rewrite failures with RHS unbound : 0 0.40/0.95 % BW rewrite match attempts : 128 0.40/0.95 % BW rewrite match successes : 97 0.40/0.95 % Condensation attempts : 1009 0.40/0.95 % Condensation successes : 1 0.40/0.95 % Termbank termtop insertions : 75766 0.40/0.95 % Search garbage collected termcells : 15386 0.40/0.95 0.40/0.95 % ------------------------------------------------- 0.40/0.95 % User time : 0.204 s 0.40/0.95 % System time : 0.020 s 0.40/0.95 % Total time : 0.224 s 0.40/0.95 % Maximum resident set size: 7728 pages 0.40/0.95 0.40/0.95 % ------------------------------------------------- 0.40/0.95 % User time : 0.394 s 0.40/0.95 % System time : 0.069 s 0.40/0.95 % Total time : 0.463 s 0.40/0.95 % Maximum resident set size: 6144 pages 0.40/0.95 % E exiting 0.40/0.96 EOF